Imagine you're managing tasks for a CPU, an emergency room, or a customer service queue.

  • Some tasks are more important than others. A simple "First-In, First-Out" (FIFO) queue isn't enough. We need to handle the highest-priority item first, regardless of when it arrived.
  • Question: What data structure efficiently manages a dynamic collection of items with priorities?
FIFO
→
Task A (High)
✓
Task B (Medium)
Task C (Low)
✗
→